\VORKING NOTES AA.t\I FALL SYi\IPOSIUNl SERIES

نویسندگان

  • Kevin Bowyer
  • Kim L. Boyer
  • Malini Bhandaru
  • Victor Lesser
  • Shree K. Nayar
  • Michael M. Skolnick
  • Thang C. Nguyen
  • David E. Goldberg
  • Thomas S. Huang
  • Richard S. Zemel
  • Geoffrey E. Hinton
چکیده

The paper introduces a transition from the traditional train-recognize paradigm into a leaming­ based active agent paradigm for the object recognition task. The role of different learning techniques is pointed out. We justify that a progress in the integration of learning and vision is in the development of new paradigms rather than in a simple transition of developed learning programs into the vision domain. The development of such paradigms provides an opportunity to build systems capable to learn and behave in an active manner even after the initial training is finished. We suggest that leaming-based vision systems should be capable to run leaming processes within the close-loop with the recognition processes; i.e., running in a "never stop learning" mode. In this case, the traditional direct distinction between the training and recognition phases tends to disappear. We indicate that the learning technology will have a major influence in the development of such autonomous active behaviors for robust object recognition systems. Some of example issues are discussed in terms of the face identification problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sum of Squares Upper Bounds, Lower Bounds, and Open Questions

Preface These are lecture notes for a seminar series I gave at MIT in the fall of 2014. The notes are very rough, undoubtedly containing plenty of bugs and tpyos, but I hope people would find them useful nonetheless. (One particular area in which the notes are rough is that in most cases I mention papers and work in the text without providing a formal references.) The notes were made before the...

متن کامل

CS 49 : Data Stream Algorithms Lecture Notes , Fall 2011 Amit

Acknowledgements These lecture notes began as rough scribe notes for a Fall 2009 offering of the course " Data Stream Algorithms " at Dartmouth College. The initial scribe notes were prepared mostly by students enrolled in the course in 2009. Subsequently, during a Fall 2011 offering of the course, I edited the notes heavily, bringing them into presentable form, with the aim being to create a r...

متن کامل

Cs49: Data Stream Algorithms Lecture Notes, Fall 2011

Acknowledgements These lecture notes began as rough scribe notes for a Fall 2009 offering of the course " Data Stream Algorithms " at Dartmouth College. The initial scribe notes were prepared mostly by students enrolled in the course in 2009. Subsequently, during a Fall 2011 offering of the course, I edited the notes heavily, bringing them into presentable form, with the aim being to create a r...

متن کامل

Lecture Notes: Distributed Algorithms

This booklet includes lecture notes from parallel and distributed computing course I taught in Fall 07, Spring 08, and Fall 08 at the Kent State University, USA. I wrote a good part of these notes in Fall 2007; I revise them every time I teach the course. The problems in the notes have been used in class lectures, homework assignments, or exams. You can nd a collection of homework assignments a...

متن کامل

Lecture notes on embedded contact homology

These notes give an introduction to embedded contact homology (ECH) of contact three-manifolds, gathering together many basic notions which are scattered across a number of papers. We also discuss the origins of ECH, including various remarks and examples which have not been previously published. Finally, we review the recent application to four-dimensional symplectic embedding problems. This a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009